Search results for "Turbo code"
showing 3 items of 3 documents
Simple method for limiting delay of optimized interleavers for turbo-codes
2000
An iterative interleaver growth algorithm is extended to allow the delay and required memory of designed interleavers to be halved with negligible performance loss. The original algorithm is efficient for two-component parallel concatenated turbo-codes with given constituent encoders that are optimum with regard to a cost function satisfying some mild conditions. However, it is only actually optimum if the selected set of patterns is representative of low-weight turbo-codewords. The new interleaver uses all terminating error patterns having an input weight not greater than a fixed IWX and single-coder output weight not greater than WX is proposed.
A Digital Watermarking Algorithm Based on Quantization of the DCT: Application on Medical Imaging
2013
International audience; The objective of this paper is to elaborate a new watermarking algorithm applied to the medical imaging. This algorithm must be invisible, robust and has a rate, relatively high, integrating data. The proposed method uses the standard JPEG compression for the integration of medical data. The insertion block is inserted just after the quantization phase. To control identification and eventually the correction (if possible) of the inserted data, we use a series of turbocodes to recover the inserted data, after application of several attacks. The simulation studies are applied on MRI medicals images.
On strongly tactical codes
1986
We study perfect error correcting codes in which the codewords are protected by Hamming spheres of distinct protective radii. These codes have been introduced by Cohen, Montaron and Frankl [3, 4, 10].